A Prolog implementation of the Functional Unification Grammar Formalism
نویسندگان
چکیده
This paper compares the use of Lisp and Prolog for the implementation of a functional grammar unification system. To achieve this comparison, we have taken as a starting point Michael Elhadad’s FUF system, which is written in Lisp and produced a much smaller and more efficient Prolog version (PFUF) retaining many of FUF’s essential features. Our approach is based on a precompilation scheme that reduces most of the runtime overhead.
منابع مشابه
QPATR and Constraint Threading
QPATR is an MS-DOS Arity/PROLOG implementation of the PATR-II formalism for unification grammar. The fbnnalism has been extended to include the constraints of LFG as well as negation and disjunction, which are implemented with the disjunction and negation-as-failure of PROLOG itself. A technique of constraint threading is employed to collect negative and constraining conditions in PROLOG differ...
متن کاملA Logic-Based Implementation of Head-Driven Phrase Structure Grammar
Head-Driven Phrase Structure Grammar (HPSG), a unification-based formal language for describing linguistic phenomena, has a declarative semantics which makes it amenable to specification as a logic program. The HPSG formalism has undergone significant modification, becoming more declarative and incorporating greater lexicalization, since Proudian and Pollard first introduced a LISP-based HPSG c...
متن کاملA Prolog Implementation of the Functional Uniication Grammar Formalism
This paper compares the use of Lisp and Prolog for the implementation of a functional grammar uniication system. To achieve this comparison, we have taken as a starting point Michael Elhadad's FUF system, which is written in Lisp and produced a much smaller and more eecient Prolog version (PFUF) retaining many of FUF's essential features. Our approach is based on a precompilation scheme that re...
متن کاملA Structure-Sharing Representation for Unification-Based Grammar Formalisms
This paper describes a structure-sharing method for the representation of complex phrase types in a parser for PATR-[I, a unification-based grammar formalism. In parsers for unification-based grammar formalisms, complex phrase types are derived by incremental refinement of rite phrase types defined in grammar rules and lexical entries. In a naive implementation, a new phrase type is built by co...
متن کاملParsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کامل